Deriving upwinding, mass lumping and selective reduced integration by residual-free bubbles

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deriving Upwinding, Mass Lumping and Selective Reduced Integration by Residual-free Bubbles

We show that three well-known \variational crimes" in nite elements { upwinding, mass lumping and selective reduced integration { may be derived from the Galerkin method employing the standard polynomial-based nite element spaces enriched with residual-free bubbles.

متن کامل

Mass Lumping Emanating from Residual-free Bubbles

A nodally exact scheme is derived for a model equation in 1D involving zeroth and second order terms. The method is derived using residual-free bubbles in conjunction with the Galerkin approximation. It is shown that this approach leads to the mass lumping scheme for su ciently small mesh sizes. 1. The residual-free bubbles approach. The usage of the Galerkin method enriched with bubble functio...

متن کامل

Further Considerations on Residual-free Bubbles for Advective-diffusive Equations

We further consider the Galerkin method for advective-diiusive equations in two-dimensions. The nite dimensional space employed is of piecewise polynomials enriched with residual-free bubbles (RFB). We show that, in general, this method does not coincide with the SUPG method, unless the piecewise polynomials are spanned by linear functions. Furthermore a simple stability analysis argument displ...

متن کامل

Global and Local Error Analysis for the Residual-Free Bubbles Method Applied to Advection-Dominated Problems

We prove the stability and a priori global and local error analysis for the residual-free bubbles finite element method applied to advection dominated advection-diffusion problems.

متن کامل

Deriving Residual Reference Count Garbage Collectors

We present a strategy to derive an efficient reference count garbage collector for any applicative program by only modifying it on the source code level. The key to the approach is to consider the memory as an explicit parameter of the applicative program, thus enabling to implement data structures in terms of memory primitives. On the basis of equivalence preserving source level transformation...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematics Letters

سال: 1996

ISSN: 0893-9659

DOI: 10.1016/0893-9659(96)00078-x